翻訳と辞書 Words near each other ・ Additive ・ Additive Architecture ・ Additive category ・ Additive color ・ Additive function ・ Additive genetic effects ・ Additive group ・ Additive identity ・ Additive increase/multiplicative decrease ・ Additive inverse ・ Additive K-theory ・ Additive Manufacturing File Format ・ Additive map ・ Additive Markov chain ・ Additive model ・ Additive number theory ・ Additive polynomial ・ Additive rhythm and divisive rhythm ・ Additive Schwarz method ・ Additive smoothing ・ Additive State Decomposition ・ Additive synthesis ・ Additive white Gaussian noise ・ Additively indecomposable ordinal ・ Additives for cut flowers ・ Additron tube ・ ADDitude Magazine ・ Additur ・ Addizione Erculea ・ Addled Parliament Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Additive number theory ： ウィキペディア英語版 Additive number theory In number theory, the specialty additive number theory studies subsets of integers and their behavior under addition. More abstractly, the field of "additive number theory" includes the study of abelian groups and commutative semigroups with an operation of addition. Additive number theory has close ties to combinatorial number theory and the geometry of numbers. Two principal objects of study are the sumset of two subsets ''A'' and ''B'' of elements from an abelian group ''G'', :$A\; +\; B\; =\; \backslash$, and the h-fold sumset of ''A'', :$hA\; =\; \backslash underset\{\backslash underbrace\{A\; +\; \backslash cdots\; +\; A\}\}.$ There are two main subdivisions listed below. ==Additive number theory== The first is principally devoted to consideration of ''direct problems'' over (typically) the integers, that is, determining the structure of ''hA'' from the structure of ''A'': for example, determining which elements can be represented as a sum from ''hA'', where ''A'' is a fixed subset.〔Nathanson (1996) II:1〕 Two classical problems of this type are the Goldbach conjecture (which is the conjecture that 2''P'' contains all even numbers greater than two, where ''P'' is the set of primes) and Waring's problem (which asks how large must ''h'' be to guarantee that ''hAk'' contains all positive integers, where :$A\_k=\backslash$ is the set of k-th powers). Many of these problems are studied using the tools from the Hardy-Littlewood circle method and from sieve methods. For example, Vinogradov proved that every sufficiently large odd number is the sum of three primes, and so every sufficiently large even integer is the sum of four primes. Hilbert proved that, for every integer ''k'' > 1, every nonnegative integer is the sum of a bounded number of ''k''-th powers. In general, a set ''A'' of nonnegative integers is called a basis of order ''h'' if ''hA'' contains all positive integers, and it is called an asymptotic basis if ''hA'' contains all sufficiently large integers. Much current research in this area concerns properties of general asymptotic bases of finite order. For example, a set ''A'' is called a minimal asymptotic basis of order ''h'' if ''A'' is an asymptotic basis of order h but no proper subset of ''A'' is an asymptotic basis of order ''h''. It has been proved that minimal asymptotic bases of order ''h'' exist for all ''h'', and that there also exist asymptotic bases of order ''h'' that contain no minimal asymptotic bases of order ''h''. Another question to be considered is how small can the number of representations of ''n'' as a sum of ''h'' elements in an asymptotic basis can be. This is the content of the Erdős–Turán conjecture on additive bases. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Additive number theory」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.